Wilf-equivalence for Singleton Classes
نویسنده
چکیده
Write p1p2 : : : pm for the permutation matrix p i ;j. Let Sn(M) be the set of n n permutation matrices which do not contain the m m permutation matrix M as a submatrix. In 2] Simion and Schmidt show bijectively that jSn(123)j = jSn(213)j. In the present work this is generalised to a bijection between Sn result was established for t = 2 in 5] and for t = 3 in 8].
منابع مشابه
On Wilf Equivalence for Alternating Permutations
In this paper, we obtain several new classes of Wilf-equivalent patterns for alternating permutations. In particular, we prove that for any nonempty pattern τ , the patterns 12 . . . k ⊕ τ and k . . . 21 ⊕ τ are Wilf-equivalent for alternating permutations, paralleling a result of Backelin, West, and Xin for Wilf-equivalence for
متن کاملWilf-Equivalence on k-ary Words, Compositions, and Parking Functions
In this paper, we study pattern-avoidance in the set of words over the alphabet [k]. We say that a word w ∈ [k] contains a pattern τ ∈ [l], if w contains a subsequence order-isomorphic to τ . This notion generalizes pattern-avoidance in permutations. We determine all the Wilf-equivalence classes of word patterns of
متن کاملWilf Classes of Pairs of Permutations of Length 4
Sn(π1, π2, . . . , πr) denotes the set of permutations of length n that have no subsequence with the same order relations as any of the πi. In this paper we show that |Sn(1342, 2143)| = |Sn(3142, 2341)| and |Sn(1342, 3124)| = |Sn(1243, 2134)|. These two facts complete the classification of Wilf-equivalence classes for pairs of permutations of length four. In both instances we exhibit bijections...
متن کاملPattern avoidance in binary trees
This paper introduces the notion of pattern avoidance in binary trees. We provide an algorithm for computing the generating function that counts the number of n-leaf binary trees avoiding a given binary tree pattern t. Equipped with this counting mechanism, we study the analogue of Wilf equivalence in which two tree patterns are equivalent if the respective trees that avoid them are equinumerou...
متن کاملA General Theory of Wilf-Equivalence for Catalan Structures
The existence of apparently coincidental equalities (also called Wilf-equivalences) between the enumeration sequences or generating functions of various hereditary classes of combinatorial structures has attracted significant interest. We investigate such coincidences among non-crossing matchings and a variety of other Catalan structures including Dyck paths, 231-avoiding permutations and plane...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001